package com.wc.alorithm_blue_bridge._动态规划.状压DP.再遇白骨精;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/7/29 17:07
 * @description https://www.lanqiao.cn/problems/19748/learning/?contest_id=197
 */
public class Main {
    /**
     * 题目看的不是很懂, 为什么不对
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 110, M = 11;
    static int n, m, k, P = 998244353;

    public static void main(String[] args) {
        n = sc.nextInt();
        m = sc.nextInt();
        k = sc.nextInt();
        long res = 0;
        for (int i = 0; i < 1 << n; i++) {
            int cnt = cnt(i);
            if (cnt >= k) {
                res = (res + qkm((qkm(2, m) - 1 + P) % P, n - cnt)) % P;
            }
        }
        if (m == 1) out.println(qkm(2, n));
        else out.println(res);
        out.flush();
    }

    static long qkm(long a, int b) {
        long res = 1;
        while (b > 0) {
            if ((b & 1) == 1) res = res * a % P;
            a = a * a % P;
            b >>= 1;
        }
        return res;
    }

    static int cnt(int x) {
        int res = 0;
        for (int i = 0; i < n; i++) {
            if ((x >> i & 1) == 1) res++;
        }
        return res;
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
